我们解决了监视一组二进制随机过程的问题，并在其中的异常数超过阈值时生成警报。为此，决策者选择并探测过程的子集以获得其状态的噪声估计（正常或异常）。根据所接收的观察，决策者首先确定是否声明异常数已超过阈值或继续观察。当决定继续时，它会决定是否在下次即时收集观察，或者将其推迟到以后的时间。如果它选择收集观察，它进一步确定了待探测的过程的子集。为了设计这三步的顺序决策过程，我们使用贝叶斯制剂，其中我们学习了过程的状态的后验概率。使用后验概率，我们构建了马尔可夫决策过程，并利用深刻的演员批评加强学习解决了它。通过数值实验，我们展示了与传统的基于模型的算法相比的算法的卓越性能。

我们解决了从给定集中选择和观察过程的问题，以找到其中的异常。决策者在任何给定的时间瞬间观察过程的子集，并获得相应过程是否异常的嘈杂二进制指示符。在该设置中，我们开发了一种异常检测算法，该检测算法选择在给定的时间瞬间观察的过程，决定何时停止观察，并宣布对异常过程的决定。检测算法的目的是识别具有超过所需值的精度的异常，同时最小化决策制定的延迟。我们设计了一种集中式算法，其中通过公共代理和分散算法共同选择进程，其中对于每个过程独立决定是否选择过程。我们的算法依赖于使用每个过程的边际概率定义的马尔可夫决策过程正常或异常，调节观察结果。我们利用深度演员批评加强学习框架实现了检测算法。与在此主题的事先工作不同，在流程数量中具有指数复杂性，我们的算法具有在过程数量中的多项式的计算和内存要求。我们通过将它们与最先进的方法进行比较来证明这些算法使用数值实验的功效。

人类在整个生命周期中不断学习，通过积累多样化的知识并为未来的任务进行微调。当出现类似目标时，神经网络会遭受灾难性忘记，在学习过程中跨顺序任务跨好任务的数据分布是否不固定。解决此类持续学习（CL）问题的有效方法是使用超网络为目标网络生成任务依赖权重。但是，现有基于超网的方法的持续学习性能受到整个层之间权重的独立性的假设，以维持参数效率。为了解决这一限制，我们提出了一种新颖的方法，该方法使用依赖关系保留超网络来为目标网络生成权重，同时还保持参数效率。我们建议使用基于复发的神经网络（RNN）的超网络，该网络可以有效地生成层权重，同时允许在它们的依赖关系中。此外，我们为基于RNN的超网络提出了新颖的正则化和网络增长技术，以进一步提高持续的学习绩效。为了证明所提出的方法的有效性，我们对几个图像分类持续学习任务和设置进行了实验。我们发现，基于RNN HyperNetworks的建议方法在所有这些CL设置和任务中都优于基准。

基于模糊规则的系统（FRBS）是一个基于规则的系统，它使用语言模糊变量作为前身，因此代表人类可理解的知识。它们已应用于整个文献的各种应用和领域。但是，FRBS遭受了许多缺点，例如不确定性表示，大量规则，解释性损失，学习时间高的计算时间等，以克服FRBS的这些问题，存在许多范围的FRBS。在本文中，我们介绍了模糊系统（FRBS）的各种类型和突出领域的概述和文献综述，即遗传模糊系统（GFS），层次结构模糊系统（HFS），Neuro Fuzzy System（NFS），不断发展的模糊系统（EFS）（EFS）（EFS） ），在2010 - 2021年期间，用于大数据的FRBS，用于数据不平衡数据的FRBS，用于不平衡数据的FRBS，用于使用集群质心作为模糊规则的FRB和FRBS。 GFS使用遗传/进化方法来提高FRBS的学习能力，HFS解决了FRBS的尺寸诅咒，NFS在EFS中考虑使用神经网络和动态系统来提高FRBS的近似能力，并且在EFS中考虑了动态系统。 FRBs被视为大数据和不平衡数据的好解决方案，近年来，由于高维度和大数据和规则，使用集群质心来限制FRBS中的规则数量，因此FRBS的可解释性已受欢迎。本文还强调了该领域的重要贡献，出版统计和当前趋势。该论文还涉及几个需要从FRBS研究社区进一步关注的开放研究领域。

尽管当前的视觉算法在许多具有挑战性的任务上都表现出色，但尚不清楚他们如何理解现实世界环境的物理动态。在这里，我们介绍了Physion，一种数据集和基准，用于严格评估预测物理场景如何随着时间而发展的能力。我们的数据集具有对各种物理现象的现实模拟，包括刚性和软体体碰撞，稳定的多对象配置，滚动，滑动和弹丸运动，因此比以前的基准提供了更全面的挑战。我们使用Physion来基准一套模型，其体系结构，学习目标，投入输出结构和培训数据各不相同。同时，我们在同一场景上获得了人类预测行为的精确测量，从而使我们能够直接评估任何模型能够近似人类行为的效果。我们发现，学习以对象为中心的表示的视觉算法通常优于那些没有人的表现，但仍未达到人类绩效。另一方面，绘制具有直接访问物理状态信息的神经网络的表现效果更好，并且做出与人类制作的预测更相似。这些结果表明，提取场景的物理表征是在视力算法中实现人类水平和类似人类的物理理解的主要瓶颈。我们已公开发布了所有数据和代码，以促进使用物理以完全可重现的方式对其他模型进行基准测试，从而使对视觉算法的进度进行系统的评估，这些算法像人们一样坚固地了解物理环境。

Designing experiments often requires balancing between learning about the true treatment effects and earning from allocating more samples to the superior treatment. While optimal algorithms for the Multi-Armed Bandit Problem (MABP) provide allocation policies that optimally balance learning and earning, they tend to be computationally expensive. The Gittins Index (GI) is a solution to the MABP that can simultaneously attain optimality and computationally efficiency goals, and it has been recently used in experiments with Bernoulli and Gaussian rewards. For the first time, we present a modification of the GI rule that can be used in experiments with exponentially-distributed rewards. We report its performance in simulated 2- armed and 3-armed experiments. Compared to traditional non-adaptive designs, our novel GI modified design shows operating characteristics comparable in learning (e.g. statistical power) but substantially better in earning (e.g. direct benefits). This illustrates the potential that designs using a GI approach to allocate participants have to improve participant benefits, increase efficiencies, and reduce experimental costs in adaptive multi-armed experiments with exponential rewards.

Modelling and forecasting real-life human behaviour using online social media is an active endeavour of interest in politics, government, academia, and industry. Since its creation in 2006, Twitter has been proposed as a potential laboratory that could be used to gauge and predict social behaviour. During the last decade, the user base of Twitter has been growing and becoming more representative of the general population. Here we analyse this user base in the context of the 2021 Mexican Legislative Election. To do so, we use a dataset of 15 million election-related tweets in the six months preceding election day. We explore different election models that assign political preference to either the ruling parties or the opposition. We find that models using data with geographical attributes determine the results of the election with better precision and accuracy than conventional polling methods. These results demonstrate that analysis of public online data can outperform conventional polling methods, and that political analysis and general forecasting would likely benefit from incorporating such data in the immediate future. Moreover, the same Twitter dataset with geographical attributes is positively correlated with results from official census data on population and internet usage in Mexico. These findings suggest that we have reached a period in time when online activity, appropriately curated, can provide an accurate representation of offline behaviour.

Existing federated classification algorithms typically assume the local annotations at every client cover the same set of classes. In this paper, we aim to lift such an assumption and focus on a more general yet practical non-IID setting where every client can work on non-identical and even disjoint sets of classes (i.e., client-exclusive classes), and the clients have a common goal which is to build a global classification model to identify the union of these classes. Such heterogeneity in client class sets poses a new challenge: how to ensure different clients are operating in the same latent space so as to avoid the drift after aggregation? We observe that the classes can be described in natural languages (i.e., class names) and these names are typically safe to share with all parties. Thus, we formulate the classification problem as a matching process between data representations and class representations and break the classification model into a data encoder and a label encoder. We leverage the natural-language class names as the common ground to anchor the class representations in the label encoder. In each iteration, the label encoder updates the class representations and regulates the data representations through matching. We further use the updated class representations at each round to annotate data samples for locally-unaware classes according to similarity and distill knowledge to local models. Extensive experiments on four real-world datasets show that the proposed method can outperform various classical and state-of-the-art federated learning methods designed for learning with non-IID data.

This is paper for the smooth function approximation by neural networks (NN). Mathematical or physical functions can be replaced by NN models through regression. In this study, we get NNs that generate highly accurate and highly smooth function, which only comprised of a few weight parameters, through discussing a few topics about regression. First, we reinterpret inside of NNs for regression; consequently, we propose a new activation function--integrated sigmoid linear unit (ISLU). Then special charateristics of metadata for regression, which is different from other data like image or sound, is discussed for improving the performance of neural networks. Finally, the one of a simple hierarchical NN that generate models substituting mathematical function is presented, and the new batch concept ``meta-batch" which improves the performance of NN several times more is introduced. The new activation function, meta-batch method, features of numerical data, meta-augmentation with metaparameters, and a structure of NN generating a compact multi-layer perceptron(MLP) are essential in this study.

The existing methods for video anomaly detection mostly utilize videos containing identifiable facial and appearance-based features. The use of videos with identifiable faces raises privacy concerns, especially when used in a hospital or community-based setting. Appearance-based features can also be sensitive to pixel-based noise, straining the anomaly detection methods to model the changes in the background and making it difficult to focus on the actions of humans in the foreground. Structural information in the form of skeletons describing the human motion in the videos is privacy-protecting and can overcome some of the problems posed by appearance-based features. In this paper, we present a survey of privacy-protecting deep learning anomaly detection methods using skeletons extracted from videos. We present a novel taxonomy of algorithms based on the various learning approaches. We conclude that skeleton-based approaches for anomaly detection can be a plausible privacy-protecting alternative for video anomaly detection. Lastly, we identify major open research questions and provide guidelines to address them.